منابع مشابه
Intersections of hypergraphs
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions.
متن کاملIntersections of random hypergraphs and tournaments
Given two random hypergraphs, or two random tournaments of order n, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.
متن کاملOn the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2 with (k, r)-bounded intersections, i.e. in which the intersection of any k distinct hyperedges has size at most r. We consider the problem MIS(A, I): given a hypergraph A and a subfamily I ⊆ I(A), of its maximal independent sets (MIS) I(A), either extend this subfamily by constructing a new MIS...
متن کاملThe representation of multi-hypergraphs by set intersections
This paper deals with weighted set systems (V, E , q), where V is a set of indices, E ⊂ 2 and the weight q is a nonnegative integer function on E . The basic idea of the paper is to apply weighted set systems to formulate restrictions on intersections. It is of interest to know whether a weighted set system can be represented by set intersections. An intersection representation of (V, E , q) is...
متن کاملGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2 with (k, r)-bounded intersections, i.e. in which the intersection of any k distinct hyperedges has size at most r. We consider the problem MIS(A, I): given a hypergraph A and a subfamily I ⊆ I(A), of its maximal independent sets (MIS) I(A), either extend this subfamily by constructing a new MIS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2015
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.08.002